The Conner-Floyd map for formal $A$-modules
نویسندگان
چکیده
منابع مشابه
The Conner-floyd Map for Formal A-modules
A generalization of the Conner-Floyd map from complex cobordism to complex /C-theory is constructed for formal A-modules when A is the ring of algebraic integers in a number field or its p-adic completion. This map is employed to study the Adams-Novikov spectral sequence for formal A-modules and to confirm a conjecture of D. Ravenel. 0. Introduction. Let BP be the spectrum representing Brown-Pe...
متن کاملLewis A. Conner: Cornell's Osler.
Lewis A. Conner, MD (1867 to 1950), was a pioneer in public health cardiology, cardiac rehabilitation, and cardiac psychology. He helped establish the Burke Rehabilitation Hospital and was the founding president of the New York and American Heart Associations (AHA). Dr Conner was the founder of the American Heart Journal, America's first medical subspecialty journal, and the official publicatio...
متن کاملformal local cohomology modules and serre subcategories
let ( r,m ) be a noetherian local ring, a an ideal of r and m a finitely generated r- module. we investigate some properties of formal local cohomology modules with respect to a serre subcategory. we provide a common language to indicate some properties of formal local cohomology modules. let ( r,m ) be a noetherian local ring, a an ideal of r and m a finitely generated r- module. we investigat...
متن کاملThe Floyd-Warshall Algorithm for Shortest Paths
The Floyd-Warshall algorithm [Flo62, Roy59, War62] is a classic dynamic programming algorithm to compute the length of all shortest paths between any two vertices in a graph (i.e. to solve the all-pairs shortest path problem, or APSP for short). Given a representation of the graph as a matrix of weights M , it computes another matrix M ′ which represents a graph with the same path lengths and c...
متن کاملTagged Dataflow: a Formal Model for Iterative Map-Reduce
In this paper, we consider the recent iterative extensions of the Map-Reduce framework and we argue that they would greatly benefit from the research work that was conducted in the area of dataflow computing more than thirty years ago. In particular, we suggest that the tagged-dataflow model of computation can be used as the formal framework behind existing and future iterative generalizations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1987
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1987-0887512-x